Large dimensional random k circulants
نویسندگان
چکیده
Circulant matrices with general shift by k places have been studied in the literature and formula for their eigenvalues is known. We first reestablish this formula and some further properties of these eigenvalues in a manner suitable for our use. We then consider random k = k(n) circulants Ak,n with n → ∞ and whose input sequence {ai} is independent with mean zero and variance one and supn n −1 ∑n i=1 E|ai| < ∞ for some δ > 0. Under suitable restrictions on {k(n)}, we show that the limiting spectral distribution (LSD) of the empirical distribution of suitably scaled eigenvalues exists and identify the limits. As examples, (i) if kg = −1 + sn where g ≥ 1 fixed and s = o(n1/3), then the LSD is U1( ∏g i=1 Ei) 1/2g where Ei are i.i.d. Exp(1) and U1 is uniformly distributed over the (2g)th roots of unity, independent of the {Ei}, and (ii) if kg = 1 + sn where g ≥ 2 is fixed and s = o(n g+1 g−1 ) or s = o(n) according as g ≥ 2 is odd or even, then the LSD is U2( ∏g i=1 Ei) 1/2g where {Ei} are i.i.d. Exp(1) and U2 is uniformly distributed over the unit circle, independent of the {Ei}. We then consider the limit distribution of the spectral norm of Ak,n. We show that when n = k2 +1 → ∞, the spectral norm, with appropriate scaling and centering, which we provide explicitly, converges to the Gumbel distribution.
منابع مشابه
Dimension-Order Routing Algorithms for a Family of Minimal-Diameter circulants
This paper presents a family of minimal-diameter, four-regular nonbipartite circulants on 2a vertices, where a is odd. If a ≡ 3 mod (4), then the step sizes are 1 and (a− 1), and if a ≡ 1 mod (4), then the step sizes are 1 and (a + 1). Each graph is obtainable from the 2a × a rectangular twisted torus by appropriately trading a total of 3a − 1 edges for as many new edges. Further, each admits a...
متن کاملIndependence polynomials of circulants with an application to music
The independence polynomial of a graph G is the generating function I(G, x) = ∑ k≥0 ikx k, where ik is the number of independent sets of cardinality k in G. We show that the problem of evaluating the independence polynomial of a graph at any fixed non-zero number is intractable, evenwhen restricted to circulants. We provide a formula for the independence polynomial of a certain family of circul...
متن کاملMARCINKIEWICZ-TYPE STRONG LAW OF LARGE NUMBERS FOR DOUBLE ARRAYS OF NEGATIVELY DEPENDENT RANDOM VARIABLES
In the following work we present a proof for the strong law of large numbers for pairwise negatively dependent random variables which relaxes the usual assumption of pairwise independence. Let be a double sequence of pairwise negatively dependent random variables. If for all non-negative real numbers t and , for 1 < p < 2, then we prove that (1). In addition, it also converges to 0 in ....
متن کاملA Classification of 2-Arc-Transitive Circulants
A graph X is k-arc-transitive if its automorphism group acts transitively on the set of it-arcs of X. A circulant is a Cayley graph of a cyclic group. A classification of 2-arc-transitive circulants is given.
متن کاملThe Normal Graph Conjecture is true for Circulants
Normal graphs are defined in terms of cross-intersecting set families: a graph is normal if it admits a clique cover Q and a stable set cover S s.t. every clique in Q intersects every stable set in S. Normal graphs can be considered as closure of perfect graphs by means of co-normal products (K ̈orner [6]) and graph entropy (Czisz ́ar et al. [5]). Perfect graphs have been recently characterized a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009